The Maximum Box Problem for moving points in the plane

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Maximum Box Problem for moving points in the plane

Given a set R of r red points and a set B of b blue points in the plane, the static version of the Maximum Box Problem is to find an isothetic box H such that H ∩ R = ∅ and the cardinality of H ∩ B is maximized. In this paper, we consider a kinetic version of the problem where the points in R ∪ B move move along bounded degree algebraic trajectories. We design a compact and local quadratic-spac...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

the search for the self in becketts theatre: waiting for godot and endgame

this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...

15 صفحه اول

Smallest Maximum-Weight Circle for Weighted Points in the Plane

Let P be a weighted set of points in the plane. In this paper we study the problem of computing a circle of smallest radius such that the total weight of the points covered by the circle is maximized. We present an algorithm with polynomial time depending on the number of points with positive and negative weight. We also consider a restricted version of the problem where the center of the circl...

متن کامل

Monodromy problem for the degenerate critical points

For the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. When the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. In this paper we will consider the polynomial planar vector fields ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Optimization

سال: 2010

ISSN: 1382-6905,1573-2886

DOI: 10.1007/s10878-010-9301-2